Further improvements on the Feng-Rao bound for dual codes
نویسندگان
چکیده
Salazar, Dunn and Graham in [15] presented an improved Feng-Rao bound for the minimum distance of dual codes. In this work we take the improvement a step further. Both the original bound by Salazar et. al., as well as our improvement are lifted so that they deal with generalized Hamming weights. We also demonstrate the advantage of working with one-way well-behaving pairs rather than weakly well-behaving or wellbehaving pairs.
منابع مشابه
Feng-Rao decoding of primary codes
We show that the Feng-Rao bound for dual codes and a similar bound by Andersen and Geil [1] for primary codes are consequences of each other. This implies that the Feng-Rao decoding algorithm can be applied to decode primary codes up to half their designed minimum distance. The technique applies to any linear code for which information on well-behaving pairs is available. Consequently we are ab...
متن کاملOn the Feng-Rao Bound for Generalized Hamming Weights
The Feng-Rao bound gives good estimates of the minimum distance of a large class of codes. In this work we are concerned with the problem of how to extend the Feng-Rao bound so that it deals with all the generalized Hamming weights. The problem was solved by Heijnen and Pellikaan in [7] for a large family of codes that includes the duals of one-point geometric Goppa codes and the q-ary Reed-Mul...
متن کاملAn improvement of the Feng-Rao bound for primary codes
We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised Cab polynomials the new bound often improves dramatically on the Feng-Rao bound for primary codes [1, 10]. The method does not only work for the minimum distance but can be applied to any generalised Hamming weight.
متن کاملDistance bounds for algebraic geometric codes
Various methods have been used to obtain improvements of the Goppa lower bound for the minimum distance of an algebraic geometric code. The main methods divide into two categories and all but a few of the known bounds are special cases of either the Lundell-McCullough floor bound or the Beelen order bound. The exceptions are recent improvements of the floor bound by Güneri-Stichtenoth-Taskin, a...
متن کاملOn the second Feng-Rao distance of Algebraic Geometry codes related to Arf semigroups
We describe the second (generalized) Feng-Rao distance for elements in an Arf numerical semigroup that are greater than or equal to the conductor of the semigroup. This provides a lower bound for the second Hamming weight for one point AG codes. In particular, we can obtain the second Feng-Rao distance for the codes defined by asymptotically good towers of function fields whose Weierstrass semi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 30 شماره
صفحات -
تاریخ انتشار 2014